# 质数判断 
# 质数：大于1的自然数，且只能被1和它本身整除的数。
def prime_number(n):
    if n < 2:
        return False
    r = range(2, int(n ** 0.5) + 1)
    for i in r:
        if n % i == 0:
            return False
    return True

"""
r = prime_number(7)
print(r)
"""

# 进制转换工具
def covert_base(number, from_base, to_base):
    if isinstance(number, str):
        demical = int(number)
    else:
        demical = number
    if to_base == 2:
        return bin(demical)
    if to_base == 8:
        return oct(demical)
    if to_base == 16:
        return hex(demical)
    if to_base == 10:
        return int(demical)
    digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
    if demical == 0:
        return 0
    result = ''
    while demical > 0:
        pass
    

"""
l = []
l2 = l
print(l is l2)
True
"""